Coarse-to-fine eye movement strategy in visual search
نویسندگان
چکیده
منابع مشابه
Coarse-to-fine eye movement strategy in visual search
Oculomotor behavior contributes importantly to visual search. Saccadic eye movements can direct the fovea to potentially interesting parts of the visual field. Ensuing stable fixations enables the visual system to analyze those parts. The visual system may use fixation duration and saccadic amplitude as optimizers for visual search performance. Here we investigate whether the time courses of fi...
متن کاملCoarse - to - Fine Visual
We study visual selection: Detect and roughly localize all instances of a generic object class, such as a face, in a greyscale scene, measuring performance in terms of computation and false alarms. Our approach is sequential testing which is coarse-tone in both in the exploration of poses and the representation of objects. All the tests are all binary and indicate the presence or absence of loo...
متن کاملEye movement optimization in visual search
In the present study we investigated whether eye movements in visual search are optimized to reduce time on task. Subjects task was to find a target object in a large field of objects that differed based on shape, color, size and numeric label. The target specification was manipulated, directly influencing the average number of fixations it took subjects to find the target object. Although a mi...
متن کاملPersistence in eye movement during visual search.
As any cognitive task, visual search involves a number of underlying processes that cannot be directly observed and measured. In this way, the movement of the eyes certainly represents the most explicit and closest connection we can get to the inner mechanisms governing this cognitive activity. Here we show that the process of eye movement during visual search, consisting of sequences of fixati...
متن کاملCoarse-to-Fine Search Techniques
The following report describes some techniques that generalize and attempt to improve upon the Coarse-to-Fine Dynamic Programming (CFDP) algorithm developed by Christopher Raphael. CFDP uses a hierarchy of abstraction graphs, iteratively searches to find optimal paths, and refines those paths until a base level is found. Our most successful approach introduces a cached heuristic that reduces th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Vision Research
سال: 2007
ISSN: 0042-6989
DOI: 10.1016/j.visres.2007.05.002